Fast evaluation of quadrature formulae on the sphere

Recently, a fast approximate algorithm for the evaluation of expansions in terms of standard L2 ( S2 ) -orthonormal spherical harmonics at arbitrary nodes on the sphere S2 has been proposed in [S. Kunis and D. Potts. Fast spherical Fourier algorithms. J. Comput. Appl. Math., 161:75 – 98, 2003]. The aim of this paper is to develop a new fast algorithm for the adjoint problem which can be used to compute expansion coefficients from sampled data by means of quadrature rules. We give a formulation in matrix-vector notation and an explicit factorisation of the spherical Fourier matrix based on the former algorithm. Starting from this, we obtain the corresponding factorisation of the adjoint spherical Fourier matrix and are able to describe the associated algorithm for the adjoint transformation which can be employed to evaluate quadrature rules for arbitrary weights and nodes on the sphere. We provide results of numerical tests showing the stability of the obtained algorithm using as examples classical Gauß-Legendre and Clenshaw-Curtis quadrature rules as well as the HEALPix pixelation scheme and an equidistribution.